GRaTIS: Free Bits in the Network
نویسندگان
چکیده
منابع مشابه
GRATIS: Free Bits In The Network ; CU-CS-1075-10
Conventional signal-to-noise (SNR) based rate adaptation algorithms in wireless networks provide limited flexibility in terms of the maximum achievable data rates. Transmitters are often forced to step down to a lower data rate due to the lack of an intermediate rate despite having a higher SNR than the minimum required for the lower rate. In this paper, we propose a novel scheme that provides ...
متن کاملanalysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولUsing Sticky Bits for Wait-Free Synchronization1
In this paper we consider implementation of atomic wait-free objects in the context of a shared-memory multiprocessor. We introduce a new primitive object, the \Sticky-Bit", and show its universality by proving that any safe implementation of a sequential object can be transformed into a wait-free atomic one using only Sticky Bits and safe registers. The Sticky Bit may be viewed as a memory-ori...
متن کاملFree Bits and Non - Approximability ( Extended
This paper investigates the possibility that tight hardness of approximation results may be derived for several combinatorial optimization problems via the “pcp-connection” (a.k.a., the FGLSS-reduction [FGLSS]). We study the amortized free bit-complexity of probabilistic verifiers and “invert the FGLSS-reduction” by showing that an NP-hardness result for the approximation of MaxClique to within...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Mobile Computing
سال: 2015
ISSN: 1536-1233
DOI: 10.1109/tmc.2013.24